Spatial and Temporal Refinement of Typed Graph Transformation Systems
نویسندگان
چکیده
Graph transformation systems support the formal modeling of dynamic, concurrent, and distributed systems. States are given by their graphical structure, and transitions are modeled by graph transformation rules. In this paper we investigate two kinds of reenement relations for graph transformation systems in order to support the development of a module concept for graph transformation systems. In a spatial reenement each rule is reened by an amalgamation of rules, in a temporal reenement it is reened by a sequence of rules.
منابع مشابه
Refinements and Modules for Typed Graph Transformation Systems
Spatial and temporal reenement relations between typed graph transformation systems have been introduced in 6, 7]. In a spatial reenement each rule is reened by an amalgamation of rules while in a temporal reenement it is reened by a sequence of rules: in both cases, the reenement relation supports the modeling of implementation. In the rst part of this paper, we further investigate the propert...
متن کاملBehavioral Refinement of Graph Transformation-Based Models
Model-driven software engineering requires the refinement of abstract models into more concrete, platform-specific ones. To create and verify such refinements, behavioral models capturing reconfiguration or communication scenarios are presented as instances of a dynamic meta-model, i.e., a typed graph transformation system specifying the concepts and basic operations scenarios may be composed o...
متن کاملGraph Transformation with Time: Causality and Logical Clocks
Following TER nets, an approach to the modelling of time in high-level Petri nets, we propose a model of time within (attributed) graph transformation systems where logical clocks are represented as distinguished node attributes. Corresponding axioms for the time model in TER nets are generalised to graph transformation systems and semantic variations are discussed. They are summarised by a gen...
متن کاملAnalysis of Hypergraph Transformation Systems in AGG based on M-Functors
Hypergraph transformation systems are examples of M -adhesive transformation systems based on M -adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simulation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper ...
متن کاملGraphs and Graph Transformations for Object-Oriented and Service-Oriented Systems
Theories of graphs and graph transformations form an important part of the mathematical foun-dations of computing, and have been applied in a wide range of areas from the design and analysisof algorithms to the formalization of various computer systems and programs. In this thesis, westudy how graphs and graph transformations can be used to model the static structure and dynamic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998